首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   473篇
  免费   37篇
  国内免费   4篇
  2022年   3篇
  2021年   21篇
  2020年   7篇
  2019年   8篇
  2018年   3篇
  2017年   15篇
  2016年   7篇
  2015年   20篇
  2014年   15篇
  2013年   78篇
  2012年   16篇
  2011年   17篇
  2010年   17篇
  2009年   10篇
  2008年   12篇
  2007年   6篇
  2006年   9篇
  2005年   10篇
  2004年   9篇
  2003年   4篇
  2002年   10篇
  2001年   8篇
  2000年   6篇
  1999年   6篇
  1998年   8篇
  1997年   12篇
  1996年   21篇
  1995年   6篇
  1991年   5篇
  1990年   3篇
  1988年   4篇
  1986年   15篇
  1985年   9篇
  1984年   6篇
  1983年   5篇
  1982年   4篇
  1981年   8篇
  1980年   5篇
  1979年   11篇
  1978年   7篇
  1977年   7篇
  1975年   9篇
  1974年   7篇
  1973年   5篇
  1972年   7篇
  1971年   4篇
  1970年   4篇
  1969年   6篇
  1968年   3篇
  1966年   3篇
排序方式: 共有514条查询结果,搜索用时 15 毫秒
101.
This paper provides a framework in which warranty policies for non-repairable items can be evaluated according to risk preferences of both buyers and sellers. In particular, a warranty price schedule is established such that sellers are indifferent among the policies. Given this schedule, a buyer's response is expressed by selecting the price-warranty combination that minimizes disutility. Within this framework, a warranty can be viewed as an instrumet of risk management that can induce more sales and greater profitability. For given utility functions, analytical results for the development of a price schedule are developed. Numerical results illustrate the substitution effects between warranty terms, prices, and risk parameters.  相似文献   
102.
We implement a solution procedure for general convex separable programs where a series of relatively small piecewise linear programs are solved as opposed to a single large one, and where, based on bound calculations developed in [13] and [14], the ranges of linearization are systematically reduced for successive programs. The procedure inherits ε-convergence to the global optimum in a finite number of steps, but perhaps its most distinct feature is the rigorous way in which ranges containing an optimal solution are reduced from iteration to iteration. This paper describes the procedure, called successive approximation, discusses its convergence, tightness of the bounds, bound-calculation overhead, and its robustness. It presents a computer implementation to demonstrate its effectiveness for general problems and compares it (1) with the more standard separable programming approach and (2) with one of the recent augmented Lagrangian methods [10] included in a comprehensive study of nonlinear programming codes [12]. It seems clear from over 130 cases resulting from 80 distinct problems studied here that significant savings in terms of computational effort can be realized by a judicious use of the procedure, and the ease with which it can be used is appreciably increased by the robustness it shows. Moreover, for most of these problems, the advantage increases as the size, nonlinearity, and the degree of desired accuracy increase. Other important benefits include significantly smaller storage requirements, the ability to estimate the error in the current solution, and to terminate the algorithm as soon as the acceptable level of accuracy has been achieved. Problems requiring up to about 10,000 nonzero elements in their specification and about 45,000 nonzero elements in the generated separable programs resulting from up to 70 original nonlinear variables and 70 nonlinear constraints are included in the computations.  相似文献   
103.
In many decision-making situations, each activity that can be undertaken may have associated with it both a fixed and a variable cost. Recently, we have encountered serveral practical problems in which the fixed cost of undertaking an activity depends upon which other activities are also undertaken. To our knowledge, no existing optimization model can accomodate such a fixed cost structure. To do so, we have therefore developed a new model called the interactive fixed charge linear programming problem (IFCLP). In this paper we present and motivate problem (IFCLP), study some of its characteristics, and present a finite branch and bound algorithm for solving it. We also discuss the main properties of this algorithm.  相似文献   
104.
105.
分析了双37舰炮射击终止时产生弹壳贴膛,退壳困难的故障,详细探讨故障产生原因,提出在装备使用过程中,使机械和电气的动作能相互制约,相互控制,避免射击终止时弹壳贴膛的改进措施。  相似文献   
106.
讨论一种新的高频重建的数值方法。此方法包括三步:首先将问题用傅立叶变换到频域;其次,用Tikhonov正则化方法求问题的正则解;最后用傅立叶反变换变回时域。它能充分利用卷积型积分方程的特性,计算复杂度低。文中给出算法,证明收敛性;还给出计算机实验结果。  相似文献   
107.
通过离散Fourier变换,给出了一个频域极小化外推算法。该算法能较好地抑制噪声干扰,其计算量小,计算机仿真结果表明,该方法有良好的应用前景。  相似文献   
108.
基于Tikhonov正则化方法的思想,提出了一个费米体系反演的数值方法。给出了一个正则算子的构成方法,克服了凭经验选择正则参数的缺点。证明了收敛性,并给出了误差估计。而且,应用该算法对费米体系反演进行了研究,对计算机给出的实验结果进行了讨论。  相似文献   
109.
在文献[1][2]结果的基础上,给出了一个费米体系数值反演的超分辨处理方法。这种广义偏离算法是基于Tikhonov正则化技术,能够在算法中附加各种限制和先验信息,抑制噪声干扰,且计算的复杂性较低。  相似文献   
110.
描述了在多媒体数据管理中基于超图的数据库状态的形式化模型,并利用面向对象的思想,提出了NBO(结点-块-对象)模型,给出了结点、块和对象的结构方式。以装备管理为例,说明了NBO模型的构造方法和系统驱动的流程。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号